Undecidability of Winkler′s r-Neighborhood Problem for Covering Digraphs
نویسندگان
چکیده
منابع مشابه
Covering digraphs by paths
The problems of miniiiwn Lg.: ana minimum vertex covers by paths results relate to papers by Galki-M&ram, Meyniel, Alspach-Pullman and mait resulti is contimed with partially ordered sets. are discussed. The others. One of tie NM+oak The terminology is rather standard, generally following Berge [3]. In any case where ar&iguity may arise we give +finiticns. Graphs alnd digraphs are f@ite, except...
متن کاملSecond Neighborhood via First Neighborhood in Digraphs
Let D be a simple digraph without loops or digons. For any v ∈ V (D), the first out-neighborhood N(v) is the set of all vertices with out-distance 1 from v and the second neighborhood N(v) of v is the set of all vertices with out-distance 2 from v. We show that every simple digraph without loops or digons contains a vertex v such that |N++(v)| ≥ γ|N+(v)|, where γ = 0.657298 . . . is the unique ...
متن کاملTwo new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملCharacteristic polynomials of ramified uniform covering digraphs
We give a decomposition formula for the characteristic polynomials of ramified uniform covers of digraphs. Similarly, we obtain a decomposition formula for the characteristic polynomials of ramified regular covers of digraphs. As applications, we establish decomposition formulas for the characteristic polynomials of branched covers of digraphs and the zeta functions of ramified covers of digraphs.
متن کاملNeighborhood operators for covering-based rough sets
Covering-based rough sets are important generalizations of the classical rough sets of Pawlak. A common way to shape lower and upper approximations within this framework is by means of a neighborhood operator. In this article, we study 24 such neighborhood operators that can be derived from a single covering. We verify equalities between them, reducing the original collection to 13 different ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1994
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1017